A By-Level Analysis of Multiplicative Exponential Linear Logic
نویسندگان
چکیده
We study the relations betweenMultiplicative Exponential Linear Logic (meLL) and Baillot-Mazza Linear Logic by Levels (mL). We design a decoration-based translation between propositional meLL and propositional mL. The translation preserves the cut elimination. Moreover, we show that there is a proof netΠ of second ordermeLL that cannot have a representative Π in second order mL under any decoration. This suggests that levels can be an analytical tool in understanding the complexity of second order quantifier.
منابع مشابه
The relational model is injective for Multiplicative Exponential Linear Logic (without weakenings)
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic equivalence relation on proofs induced by the multiset based relational model: one says that the interpretation in the model (or the semantics) is injective. We actually prove a stronger result: two cut-free proofs of...
متن کاملA Non-commutative Extension of Multiplicative Exponential Linear Logic
We extend multiplicative exponential linear logic (MELL) by a noncommutative, self-dual logical operator. The extended system, called NEL, is defined in the formalism of the calculus of structures, which is a generalisation of the sequent calculus and provides a more refined analysis of proofs. We are then able to extend the expressiveness of MELL by modelling a broad notion of sequentiality. W...
متن کاملOn Linear Logic Planning and Concurrency
We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicative exponential linear logic in a way that exhibits a non-interleaving behavioral concurrency semant...
متن کاملExpressing Additives Using Multiplicatives and Subexponentials
Subexponential logic is a variant of linear logic with a family of exponential connectives—called subexponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that a classical propositional multiplicative subexponential logic (MSEL) with one unrestricted and two linear subexponentials can en...
متن کاملOn Linear Logic Planning and Concurrency
We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicative exponential linear logic in a way that exhibits a non-interleaving behavioral concurrency semant...
متن کامل